Model Selection for Topic Models via Spectral Decomposition
نویسندگان
چکیده
Correctly choosing the number of topics plays an important role in successfully applying topic models to real world applications. Following the latest tensor decomposition framework by Anandkumar et al., we make the first attempt to provide theoretical analysis on the number of topics under Latent Dirichlet Allocation model. With mild conditions, our method provides accessible information on the number of topics, which includes both upper and lower bounds. Experimental results on synthetic datasets demonstrate that our proposed bounds are correct and tight. Furthermore, using Gaussian Mixture Model as an example, we show that our methodology can be easily generalized for analyzing the number of mixture components in other mixture models.
منابع مشابه
OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملExtending Spectral Methods to New Latent Variable Models
Latent variable models are widely used in industry and research, though the problem of estimating their parameters has remained challenging; standard techniques (e.g., Expectation-Maximization) offer weak guarantees of optimality. There is a growing body of work reducing latent variable estimation problems to a certain(orthogonal) spectral decompositions of symmetric tensors derived from the mo...
متن کاملAnalyzing the Number of Latent Topics via Spectral Decomposition
Correctly choosing the number of topics plays an important role in successfully applying topic models to real world applications. Following the latest tensor decomposition framework by Anandkumar et al., we make the first attempt to provide theoretical analysis on the number of topics under Latent Dirichlet Allocation model. With mild conditions, our method provides accessible information on th...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015